Optimal Decision Procedures for Satisfiability in Fragments of Alternating-time Temporal Logics
نویسندگان
چکیده
We consider several natural fragments of the alternating-time temporal logics ATL* and ATL with restrictions on the nesting between temporal operators and strategic quantifiers. We develop optimal decision procedures for satisfiability in these fragments, showing that they have much lower complexities than the full languages. In particular, we prove that the satisfiability problem for state formulae in the full ‘strategically flat’ fragment of ATL* is PSPACE-complete, whereas the satisfiability problems in the flat fragments of ATL and ATL are Σ3 -complete. We note that the nesting hierarchies for fragments of ATL* collapse in terms of expressiveness above nesting depth 1, hence our results cover all such fragments with lower complexities.
منابع مشابه
Size-Change Termination and Satisfiability for Linear-Time Temporal Logics
In the automata-theoretic framework, finite-state automata are used as a machine model to capture the operational content of temporal logics. Decision problems like satisfiability, subsumption, equivalence, etc. then translate into questions on automata like emptiness, inclusion, language equivalence, etc. Linear-time temporal logics like LTL, PSL and the linear-time μ-calculus have relatively ...
متن کاملAutomata-Theoretic Verification
This chapter describes the automata-theoretic approach to the satisfiability and model-checking problems for temporal logics. In a nutshell, the approach reduces these problems to standard decision problems about automata, like nonemptiness, language containment, or membership (whether a given object is accepted by a given automaton). These problems are solved using results of automata theory, ...
متن کاملOptimal Tableaux-Based Decision Procedure for Testing Satisfiability in the Alternating-Time Temporal Logic ATL+
We develop a sound, complete and practically implementable tableaux-based decision method for constructive satisfiability testing and model synthesis in the fragment ATL of the full Alternating time temporal logic ATL∗. The method extends in an essential way a previously developed tableaux-based decision method for ATL and works in 2EXPTIME, which is the optimal worst case complexity of the sat...
متن کاملAutomata: from logics to algorithms
We review, in a unified framework, translations from five different logics—monadic second-order logic of one and two successors (S1S and S2S), linear-time temporal logic (LTL), computation tree logic (CTL), and modal μ-calculus (MC)—into appropriate models of finite-state automata on infinite words or infinite trees. Together with emptiness-testing algorithms for these models of automata, this ...
متن کاملATL* Satisfiability Is 2EXPTIME-Complete
The two central decision problems that arise during the design of safety critical systems are the satisfiability and the model checking problem. While model checking can only be applied after implementing the system, satisfiability checking answers the question whether a system that satisfies the specification exists. Model checking is traditionally considered to be the simpler problem – for br...
متن کامل